A simple list-processing interpreter

Simple λΠ-interpreter for matrix computation

This project to extend the simply-typed Lambda calculus λ→ to have types dependent on constant value. In particular this language will be used to check the validity of matrix computation.

A Simple Re ective Interpreter Stanley Je erson

Procedurally re ective programming languages enable user programs to semantically extend the language itself, by permitting them to run at the level of the language implementation with access to their context. The re ective tower, rst introduced by Brian Smith [9, 10], is the principal architecture for such languages. It is informally described as an in nitely ascending tower of meta-circular i...

Visuospatial processing and the right-hemisphere interpreter.

Popular views of hemispheric asymmetry hold that the left hemisphere is specialized for linguistic and cognitive processes and fine motor control, whereas the right is specialized for visuospatial processing. Although this dichotomy contains more than a grain of truth, it is an oversimplification. Experiments with split-brain patients have demonstrated that the left hemisphere retains relativel...

Morphism: a Symbolic List Processing Language

With the formal study of natural languages, we have obtained some residual results which greatly increase our power of logical manipulation. Coupled with a computer, our language extends enormously the external logic of our computing device. This paper is concerned with a well-defined symbolic list processing language and a set of operators for this language. These operators, which we call morp...

A List-Processing Optimizer for Curry